Non-Epsilon Dominated Evolutionary Algorithm for the Set of Approximate Solutions
نویسندگان
چکیده
منابع مشابه
Optical Design with Epsilon-Dominated Multi-objective Evolutionary Algorithm
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done. In our current study, ε-MOEA converged to essentially the same Pareto-optimal solutions as the one with NSGA2, but ε-MOEA proved to be better in providing reasonably good solutions, comparable to the patented design,...
متن کاملWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملAn evolutionary algorithm approach to generate distinct sets of non-dominated solutions for wicked problems
Many engineering design problems must optimize multiple objectives. While many objectives are explicit and can be mathematically modeled, some goals are subjective and cannot be included in a mathematical model of the optimization problem. A set of alternative non-dominated fronts that represent multiple optima for problem solution can be identified to provide insight about the decision space a...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کاملwell-dispersed subsets of non-dominated solutions for momilp problem
this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2020
ISSN: 2297-8747
DOI: 10.3390/mca25010003